#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int mod = 998244353;
const int N = 1010;
const int M = 10010;

ll f[M][14];
int n,k,m,p[N];

ll qp(ll x,int t){ll res=1;for(;t;t>>=1,x=x*x%mod)if(t&1)res=res*x%mod;return res;}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,k = in,m = in; k = n - k + 1;
	for(int i = 1;i <= n;i++) p[i] = in;
	f[0][0] = 1; 
	for(int i = 1;i <= n;i++){
		for(int s = m;s >= p[i];s--)
			for(int j = k;j;j--){
				f[s][j] = ((f[s][j] + f[s-p[i]][j-1] - f[s-p[i]][j]) % mod + mod) % mod;
			}
	}
	ll ans = 0;
	for(int i = 0;i <= m;i++) ans = (ans + f[i][k] * qp(i,mod-2)) % mod;
	printf("%lld\n",(ans%mod*m+mod)%mod);
	return 0;
}

